Asymptotically optimal algorithm
ALGORITHM THAT IS AT MOST A CONSTANT FACTOR WORSE THAN THE BEST POSSIBLE ALGORITHM FOR LARGE INPUT SIZES
Asymptotic optimality; Asymptotically optimal; Asymptotically faster algorithm
In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor (independent of the input size) worse than the best possible algorithm. It is a term commonly encountered in computer science research as a result of widespread use of big-O notation.